Self-Weak Complementary Fuzzy Soft Graph

Intuitionistic Fuzzy Soft Graph

Total Strong (Weak) Domination Intuitionistic Fuzzy Graph

Complementary Nil Domination in Interval- valued Intuitionistic Fuzzy Graph

Exhaustive Verification of Weak Reconstruction For Self Complementary Graphs

This paper presents an exhaustive approach for verification of the weak reconstruction of Self Complementary Graphs upto 17 vertices. It describes the general problem of the Reconstruction Conjecture, explaining the complexity involved in checking deck-isomorphism between two graphs. In order to improve the computation time, various pruning techniques have been employed to reduce the number of ...

Total Semi - μ Strong (Weak) Domination in Intuitionistic Fuzzy Graph

In the initial stage we proposed the concept of Total Strong (Weak) domination in Fuzzy graph. It deal with the real time application that helps a individual person in crossing a road traffic signal. We will be giving a single value for vertices and edges. Enhancing the same concept, the Total Strong (Weak) domination in Intuitionistic Fuzzy graph was proposed. Here we will be giving a double v...